Bisimulation Trees and the Decidability of Weak Bisimulations
نویسندگان
چکیده
منابع مشابه
Bisimulation Quantified Modal Logics: Decidability
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under exte...
متن کاملProcess Algebra, CCS, and Bisimulation Decidability
Over the past fifteen years, there has been intensive study of formal systems that can model concurrency and communication. Two such systems are the Calculus of Communicating Systems, and the Algebra of Communicating Processes. The objective of this paper has two aspects; (1) to study the characteristics and features of these two systems, and (2) to investigate two interesting formal proofs con...
متن کاملTime-abstracted Bisimulation: Implicit Specifications and Decidability
In the last few years a number of real{time process calculi have emerged with the purpose of capturing important quantitative aspects of real{time systems. In addition, a number of process equivalences sensitive to time{quantities have been proposed, among these the notion of timed (bisimulation) equivalence in RR86, DS89, HR91, BB89, NRSV90, MT90, Wan91b]. In this paper, we introduce a time{ab...
متن کاملDecidability of Bisimulation Equivalence for Pushdown Processes
We show that bisimulation equivalence is decidable for pushdown automata without ǫ-transitions.
متن کاملLabelled Transition Systems Bisimulation and Distributed Bisimulation Algebraic Characterisation of Distributed Bisimulation Weak Observations Weak Distributed Bisimulation Algebraic Characterisation of Weak Distributed Bisimulation Communication as Mutual Observation towards an Algebraic Characterisation of Weak Distributed Bisimulation with Communication Castellani
In this paper, I will describe and critically evaluate the paper Distributed Bisimulations, by Ilaria Castellani and Matthew Hennessy [5]. The aim of their paper is to generalise bisimulation equivalence for a subset of CCS to take into account the distributed nature of processes and, thus give a noninterleaving semantic theory which has many of the advantages of the interleaving theory. This t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)01228-4